#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long LL;
const int MaxN=3100;
const int RIGHT=1, LEFT=-1;

LL N,S,K;
LL vc[MaxN],vh[MaxN],sh[MaxN];
LL cost,require,vstop,sstop,know;

LL gao(LL s,LL k,int dir){
    know=0;
    cost=0;
    require=0;
    vstop=0;
    sstop=0;
    int i=s, e=dir<0;
    while (1<=i && i<=N){
        if (know<vc[i]){
            LL tmp=require+vc[i]-know;
            if (tmp>k){ vstop=1; return i; }
            require=tmp;
            know=vc[i];
        }
        cost+=vc[i];
        know-=vc[i];

        LL kup=(sh[i-e]-vh[i])*10;

        if (know<kup){
            LL tmp=require+kup-know;
            if (tmp>k) return i;
            if (tmp==k){ sstop=1; return i-e; }
            require=tmp;
            know=kup;
        }
        know=know-kup+(sh[i-e]-vh[i+dir])*10;
        i+=dir;
    }
}

int checkend(int pos){
    if (vstop){ printf("Valley: %d\n",pos); return 1; }
    if (sstop){ printf("Summit: %d\n",pos); return 1; }
    return 0;
}

int main(){
    while (scanf("%lld%lld%lld",&N,&S,&K)!=EOF){
        if (N==0 && S==0 && K==0) break;
        for (int i=1; i<=N; i++) scanf("%lld%lld",vh+i,vc+i);
        for (int i=1; i<N; i++) scanf("%lld",sh+i);
        sh[0]=sh[N]=1e16;
        int pos=gao(S,K,RIGHT);
        if (checkend(pos)) continue;
        K=K+(vh[S]-vh[pos])*10-cost;

        int l,r=pos;
        while (1){
            l=gao(r,K,LEFT);
            if (checkend(l)) break;
            LL cosRL=cost, reqRL=require, kRL=know;
            K=K+(vh[r]-vh[l])*10-cost;

            int pr=r;
            r=gao(l,K,RIGHT);
            if (checkend(r)) break;
            LL cosLR=cost, reqLR=require, kLR=know;
            K=K+(vh[l]-vh[r])*10-cost;

            if (pr==r){
                LL reqAll=reqRL+reqLR-kRL;
                LL cosAll=cosRL+cosLR;
                if (K>=reqAll)
                    K-=((K-reqAll)/cosAll)*cosAll;  // notice!
            }
        }
    }
    return 0;
}